-
1 canonical parsing automaton
канонический анализирующий автомат; канонический автомат синтаксического анализаEnglish-Russian base dictionary > canonical parsing automaton
-
2 canonical parsing automaton
Большой англо-русский и русско-английский словарь > canonical parsing automaton
-
3 canonical parsing automaton
Вычислительная техника: канонический автомат синтаксического анализа, канонический анализирующий автоматУниверсальный англо-русский словарь > canonical parsing automaton
-
4 canonical parsing automaton
канонический анализирующий автомат, канонический автомат синтаксического анализаEnglish-Russian dictionary of computer science and programming > canonical parsing automaton
-
5 automaton
- anthropomorphic automaton
- canonical parsing automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite state automaton
- finite-memory automaton
- halting automaton
- infinite automaton
- linear-bounded automaton
- Mealy automaton
- Moore automaton
- nondeterministic automaton
- parsing automaton
- partialy specific automaton
- probabilistic automaton
- push-down automaton
- reduced automaton
- reduced-time automaton
- redundant automaton
- self-adjusting automaton
- self-reproducing automaton
- semireduced parsing automaton
- split parsing automaton
- stochastic automaton
- timed automaton
- two-way automatonEnglish-Russian dictionary of computer science and programming > automaton
-
6 parsing
1. синтаксический анализparsing automaton — анализирующий автомат; автомат синтаксического анализа
split parsing automaton — расщепленный анализирующий автомат; расщепленный автомат синтаксического анализа
canonical parsing automaton — канонический анализирующий автомат; канонический автомат синтаксического анализа
semireduced parsing automaton — полуприведенный анализирующий автомат; полуприведенный автомат синтаксического анализа
2. анализирующийEnglish-Russian dictionary of Information technology > parsing
См. также в других словарях:
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
Compiler — This article is about the computing term. For the anime, see Compiler (anime). A diagram of the operation of a typical multi language, multi target compiler A compiler is a computer program (or set of programs) that transforms source code written … Wikipedia
Context-sensitive grammar — A context sensitive grammar (CSG) is a formal grammar in which the left hand sides and right hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context sensitive grammars are more general than… … Wikipedia
List of computing topics — Originally, the word computing was synonymous with counting and calculating, and the science and technology of mathematical calculations. Today, computing means using computers and other computing machines. It includes their operation and usage,… … Wikipedia